Search results for "Call Admission Control"
showing 5 items of 5 documents
Call Admission Control in Single and Two-Tier Cellular Networks
2010
We consider four strategies for call admission control (CAC) in single and two-tier cellular networks, which are designed to ensure advantage of handover calls: dynamic redundancy (cutoff priority scheme), partial dynamic redundancy (fractional guard channel scheme), static redundancy (rigid division-based CAC scheme) and restriction of the number of new calls admitted (new call bounding scheme). We show the advantage of dynamic reservation by numerical analysis. We strictly prove it in the case of two-channel system with losses.
PCP: An End-to end Measurement Based Call Admission Control for Real-Time Services Over IP Networks
2000
Distributed end-to-end measurement based connection admission control mechanisms have been recently proposed. The goal of these schemes is to provide tight QoScon trol on a per connection basis by means of measurements taken by the edge nodes and priority based forwarding procedure at internal nodes. Since the additional flows handling procedures are implemented at the border routers and the forwarding mechanisms are for flows aggregates only, the approach is fully scalable and compatible with the IETF Differentiated Service proposal. The aim of this paper is to propose specific schemes and to investigate the advantages and limits of the approach by analyzing the basic mechanisms and evalua…
Radio network aspects
2006
Publisher Summary This chapter reviews the mobile radio access network reference scenarios (MORANS)—used to study the performance of the radio cellular networks related to UMTS and the methodologies for the radio network performance evaluation, including the theoretical connectivity models,. It discusses the techniques for radio network optimization such as the packet scheduling for cellular systems or system capacity maximization through the use of multiple antennas. . In order to perform system simulations, reference values for the main parameters characterizing a WCDMA network, are required. MORANS is used for the identification of such parameters. The parameters are classified in two gr…
Is Admission-Controlled Traffic Self-Similar?
2002
It is widely recognized that the maximum number of heavy-tailed flows that can be admitted to a network link, while meeting QoS targets, can be much lower than in the case of markovian flows. In fact, the superposition of heavy-tailed flows shows long range dependence (self-similarity), which has a detrimental impact on network performance. In this paper, we show that long range dependence is significantly reduced when traffic is controlled by a Measurement-Based Admission Control (MBAC) algorithm. Our results appear to suggest that MBAC is a value added tool to improve performance in the presence of self-similar traffic, rather than a mere approximation for traditional (parameter-based) ad…
Call admission control scheme using borrowable guard channels and prioritizing fresh calls retrials in small cell networks
2014
International audience; Recent trends in mobile cellular networks turn towards deployment of Small Cell Networks (SCNs), where, the cell size gets smaller, and thus the number of subscribers served in a cell will be relatively smaller, such that traffic models with a finite source of subscribers should be considered. Smaller cells cause the mobile subscribers to cross several cells during an ongoing conversation resulting in frequent handovers. Most of works dealing with Call Admission Control (CAC) problems based on guard channels scheme in cellular mobile networks consider models without retrials (reapeted calls phenomenon). However, almost all existing works which take into account retri…